Forcing with trees and ordinal definability
نویسندگان
چکیده
منابع مشابه
Forcing with Bushy Trees
We present several results that rely on arguments involving the combinatorics of “bushy trees”. These include the fact that there are arbitrarily slow-growing diagonally noncomputable (DNC) functions that compute no Kurtz random real, as well as an extension of a result of Kumabe in which we establish that there are DNC functions relative to arbitrary oracles that are of minimal Turing degree. ...
متن کاملOuter Model Theory and the Definability of Forcing
A new notion of class forcing was defined by M.C. Stanley in [6], which is not a priori definable in the ground model. In this thesis, we explore conditions under which the Definability Lemma holds for this new notion. There are two major approaches to this problem, one direct and one indirect. The direct method makes use of a new complexity class, σ2DFn, which lies intermediate between Σn/Πn a...
متن کاملKurepa trees and Namba forcing
We show that compact cardinals and MM are sensitive to λ-closed forcings for arbitrarily large λ. This is done by adding ‘regressive’ λ-Kurepa-trees in either case. We argue that the destruction of regressive Kurepa-trees with MM requires the use of Namba forcing.
متن کاملSuccinct Representations of Ordinal Trees
We survey succinct representations of ordinal, or rooted, ordered trees. Succinct representations use space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time.
متن کاملForcing with a Perfect Trees and Minimal A-degrees
This paper is a sequel to [3] and it contains, among other things, proofs of the results announced in the last section of that paper. In ? 1, we use the general method of [3] together with reflection arguments to study the properties of forcing with A perfect trees, for certain Spector pointclasses T, obtaining as a main result the existence of a continuum of minimal A-degrees for such T's, und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1975
ISSN: 0003-4843
DOI: 10.1016/0003-4843(75)90011-x